https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:41366 3a2 2 > · · · > pka2 k with pi(ai + 1)2 > 2a21for 1 < i < k, and the corresponding sequences in which all the inequalities are reversed and {equation presented}. We show that (3n2 | n ∈ N) has no member in the interval [2a2,2(a+ 1)2] with a ∈ N if and only if a is in the Beatty sequence ([n (3 + √6)] | n ∈ N); several generalisations are studied. Finally, we study closest linear combinations {equation presented}.]]> Wed 17 Aug 2022 15:35:48 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:50676 2) can be labeled with the integers from {1,...,|V|} and {1 respectively, in such a way that for every subgraph H isomorphic to a d-cube the sum of all the labels of H is the same. As a consequence, for every d ≥ 2, every d-dimensional grid graph is Q-supermagic where Q is the d-cube.]]> Tue 01 Aug 2023 15:12:45 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8133 Sat 24 Mar 2018 08:40:03 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8136 Sat 24 Mar 2018 08:36:10 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8137 Sat 24 Mar 2018 08:36:09 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8153 Sat 24 Mar 2018 08:36:06 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:924 Sat 24 Mar 2018 08:29:42 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:10506 Sat 24 Mar 2018 08:08:28 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21451 Sat 24 Mar 2018 08:05:46 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21683 G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph <S is complete. In this paper starting with the concept of equivalence set as seed property, we form an inequality chain of six parameters, which we call the equivalence chain of G. WE present several basic results on these parameters and problems for further investigation.]]> Sat 24 Mar 2018 08:02:55 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21311 Sat 24 Mar 2018 07:54:39 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27706 spectrum. The energy of a graph is the sum of the absolute values of its eigenvalues. In this paper, we devise an algorithm which generates the adjacency matrix of WK - recursive structures WK(3,L) and WK(4,L) and use it in the effective computation of spectrum and energy.]]> Sat 24 Mar 2018 07:40:10 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27669 Sat 24 Mar 2018 07:38:50 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27527 Sat 24 Mar 2018 07:28:58 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:51379 Mon 15 Jan 2024 15:15:51 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:34916 antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, et_f(H') = Σ_υ∈V(H')f(υ)+Σ_e∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation G^H, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.]]> Fri 06 Oct 2023 15:46:50 AEDT ]]>